Resolving entropy growth from iterative methods

نویسندگان

چکیده

Abstract We consider entropy conservative and dissipative discretizations of nonlinear conservation laws with implicit time investigate the influence iterative methods used to solve arising equations. show that Newton’s method can turn an scheme into anti-dissipative one, even when iteration error is smaller than integration error. explore several remedies, which most performant a relaxation technique, originally designed fix errors in methods. Thus, works well consort solvers, provided are on order method. To corroborate our findings, we Burgers’ equation dispersive wave find results more accurate numerical solutions non-conservative schemes, tolerance magnitude larger.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Scaling and Coordinate Descent Methods for Maximum Entropy

Maximum entropy (Maxent) is useful in many areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With many variants of IS methods, it is difficult to understand them and see the differences. In this paper, we create a general and unified framework for IS methods. This framework also connects IS and coordinate descent (CD) methods. Besides, we develop a CD...

متن کامل

Iterative Scaling and Coordinate Descent Methods for Maximum Entropy Models

Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With many variants of IS methods, it is difficult to understand them and see the differences. In this paper, we create a general and unified framework for iterative scaling methods. This framework also connects iterative s...

متن کامل

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

متن کامل

From Functional Analysis to Iterative Methods

We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the Lax-Milgram Lemma. Working in this Hilbert space context is justified because finite element operators are restrictions of infinite-dimensional Hilbert space operators to finite-dimensional subspaces. Moreover, useful ...

متن کامل

Maximum Entropy and Iterative Scaling

(Excerpts from a paper submitted for publication) 1.1 Two Optimization Problems. Suppose that we are given an initial model q 0 2 , a reference distribution ~ p, and a set of features f = (f 0 ; f 1 ; : : : ; f n). In practice, it is often the case that ~ p is the empirical distribution of a set of training samples x (1) ; x (2) : : : x (N) , and is thus given by ~ p(x) = c(x) N (1.1) where c(x...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bit Numerical Mathematics

سال: 2023

ISSN: ['0006-3835', '1572-9125']

DOI: https://doi.org/10.1007/s10543-023-00992-w